Morphism axioms

نویسنده

  • Florian Rabe
چکیده

We introduce a new concept in the area of formal logic: axioms for model morphisms. We work in the setting of specification languages that define the semantics of a theory as a category of models. While it is routine to use axioms to specify the class of models of a theory, there has so far been no analogue to systematically specify the morphisms between these models. This leads to subtle problems where it is difficult to give a theory that specifies the intended model category, or where seemingly isomorphic theories actually have non-isomorphic model categories. Our morphism axioms remedy this by providing new syntax for axiomatizing and reasoning about the properties of model morphisms. Additionally, our system resolves a subtle incompatibility between theory morphisms and model morphisms: the semantics that maps theories to model categories is functorial. While this result is standard in principle, previous formulations had to restrict the allowed theory morphisms or the allowed model morphisms. Our system allows establishing the result in full generality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Categorically Closed Topological Groups

Let ~ C be a category whose objects are semigroups with topology and morphisms are closed semigroup relations, in particular, continuous homomorphisms. An object X of the category ~ C is called ~ C-closed if for each morphism Φ ⊂ X×Y in the category ~ C the image Φ(X) = {y ∈ Y : ∃x ∈ X (x, y) ∈ Φ} is closed in Y. In the paper we survey existing and new results on topological groups, which are ~...

متن کامل

Axiomatizing Fully Complete Models for ML Polymorphic Types

We present axioms on models of system F, which are suu-cient to show full completeness for ML-polymorphic types. These axioms are given for hyperdoctrine models, which arise as adjoint models, i.e. co-Kleisli categories of linear categories. Our axiomatization consists of two crucial steps. First, we axiomatize the fact that every relevant morphism in the model generates, under decomposition, a...

متن کامل

Elgot Monads

It was the idea of Calvin Elgot [4] to use Lawvere theories for the study of the semantics of recursion. He introduced iterative theories as those Lawvere theories in which every ideal morphism e : n → n+p (representing a system of recursive equations in n variables and p parameters) has a unique solution, i. e., a unique morphism e† such that the equation e† = [e†, idp] ·e holds. Elgot proved ...

متن کامل

Foundations of a module concept for distributed object systems

This thesis provides a logical and mathematical foundation for object-oriented specification languages with a further modularisation unit between the system and object classes. The unit is denoted object-oriented module, or module for short, and initially described in an informal way. Modules offer a better approach to reusability and provide better structuring of large, complex and distributed...

متن کامل

A Compositional Characterization of Multipartite Quantum States

The primary aim of this work is to study the compositional characterization of multipartite quantum states in an abstract setting of commutative Frobenius algebras expressed internal to symmetric monoidal categories. This work is based on the compositional structure of multipartite quantum entanglement established by Bob Coecke and Aleks Kissinger in [11]. The two SLOCC classes of tripartite en...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 691  شماره 

صفحات  -

تاریخ انتشار 2017